From Marriages to Coalitions: A Soft CSP Approach
نویسندگان
چکیده
In this work we represent the Optimal Stable Marriage problem as a Soft Constraint Satisfaction Problem. In addition, we extend this problem from couples of individuals to coalitions of generic agents, in order to define new coalition-formation principles and stability conditions. In the coalition case, we suppose the preference value as a trust score, since trust can describe a nodes belief in another nodes capabilities, honesty and reliability. Soft constraints represent a general and expressive framework that is able to deal with distinct concepts of optimality by only changing the related c-semiring structure, instead of using different ad-hoc algorithms. At last, we propose an implementation of the classical OSM problem by using Integer Linear Programming tools.
منابع مشابه
Private and Efficient Stable Marriages (Matching)— a DisCSP Benchmark
We provide algorithms guaranteeing the highest level of privacy by computing uniformly random solutions to stable marriages problems. We also provide efficient algorithms extracting a non-uniformly random solution and guaranteeing t-privacy for any threshold t. The most private solution is expensive and is based on a distributed/shared CSP model of the problem. The most efficient version is bas...
متن کاملEvolutionary History of Hunter-Gatherer Marriage Practices
BACKGROUND The universality of marriage in human societies around the world suggests a deep evolutionary history of institutionalized pair-bonding that stems back at least to early modern humans. However, marriage practices vary considerably from culture to culture, ranging from strict prescriptions and arranged marriages in some societies to mostly unregulated courtship in others, presence to ...
متن کاملA Generalization of Generalized Arc Consistency: From Constraint Satisfaction to Constraint-Based Inference
Arc consistency and generalized arc consistency are two of the most important local consistency techniques for binary and non-binary classic constraint satisfaction problems (CSPs). Based on the Semiring CSP and Valued CSP frameworks, arc consistency has also been extended to handle soft constraint satisfaction problems such as fuzzy CSP, probabilistic CSP, max CSP, and weighted CSP. This exten...
متن کاملCooperative aggregate production planning: a game theory approach
Production costs in general, and workforce and inventory costs in particular, constitute a large fraction of the operating costs of many manufacturing plants. We introduce cooperative aggregate production planning as a way to decrease these costs. That is, when production planning of two or more facilities (plants) is integrated, they can interchange workforce and products inventory; thus, thei...
متن کاملAn Empirical Investigation of the Relation between Corporate Sustainability Performance (CSP) and Corporate Value: Evidence from Iran
This study provides an empirical evidence on how Corporate Sustainability Performance (CSP), is reflected in the corporate value. Using a theoretical framework combining Legitimacy theory, Stakeholder theory and Agency theory, a set of hypotheses that relate the corporate value to CSP is examined. For a sample of Iranian firms, 28 components with four dimensions as Community, Environment, Emplo...
متن کامل